On minimum-genus embeddings
نویسندگان
چکیده
منابع مشابه
Strong embeddings of minimum genus
A “folklore conjecture, probably due to Tutte” (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341–355, Academic Press, 1979]) asserts that every bridgeless cubic graph can be embedded on a surface of its own genus in such a way that the face boundaries are cycles of the graph. In this paper we consider closed 2-cell emb...
متن کاملAnnular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each disjoint cycle has length 2). Harer and Zagier explicitly determined the distribution of the number of disjoint cycles in the product of a fixed cycle of length 2n and the elements of P2n. Their famous result has been repro...
متن کاملEmbeddings of Cubic Halin Graphs: Genus Distributions∗
We derive an O(n)-time algorithm for calculating the genus distribution of a given 3-regular Halin graph G; that is, we calculate the sequence of numbers g0(G), g1(G), g2(G), . . . on the respective orientable surfaces S0, S1, S2, . . . . Key topological features are a quadrangular decomposition of plane Halin graphs and a new recombinant-strands reassembly process that fits pieces together thr...
متن کاملHardness and approximation of minimum distortion embeddings
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, or split graph. This implies the NP-hardness of the problem also on chordal, cocomparability, and AT-free graphs. This problem is hard to approximate within a constant factor on arbitrary graphs. We give polynomial-time...
متن کاملGenus distributions of orientable embeddings for two types of graphs
Abstract On the basis of the joint tree model introduced by Liu in 2003, the genus distributions of the orientable embeddings for further types of graphs can be obtained. These are apparently not easily obtained using overlap matrices, the formula of Jackson, etc. In this paper, however, by classifying the associated surfaces, we calculate the genus distributions of the orientable embeddings fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00325-d